Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling

Cataloged from PDF version of article.Beam search (BS) is used as a heuristic to solve various combinatorial optimization problems, ranging from scheduling to assembly line balancing. In this paper, we develop a backtracking and an exchange-of-information (EOI) procedure to enhance the traditional beam search method. The backtracking enables us to return to previous solution states in the search process with the expectation of obtaining better solutions. The EOI is used to transfer information accumulated in a beam to other beams to yield improved solutions. We developed six different versions of enhanced beam algorithms to solve the mixed-model assembly line scheduling problem. The results of computational experiments indicate that the backtracking and EOI procedures that utilize problem specific information generally improve the solution quality of BS. 2007 Elsevier B.V. All rights reserved

Mixed-model assembly line sequencing using beam search

In today's manufacturing environments, companies have to produce a large variety of products in small quantities on a single assembly line. In this paper, we use a beam search (BS) approach to solve the model-sequencing problem of mixed-model assembly lines (MMALs). Specifically, we develop six BS algorithms for part-usage variation and load-leveling performance measures. The results of computational experiments indicate that the proposed BS methods are competitive with the well-known heuristics in the literature. A comprehensive bibliography is also provided

Analysis of serial production lines: Characterisation study and a new heuristic procedure for optimal buffer allocation

Buffer allocation in serial production lines is one of the important design issues, and hence it has been studied extensively in the literature. In this paper, we analyse the problem to characterise the optimal buffer allocation; specifically, we study the cases with single and multiple bottleneck stations under various experimental conditions. In addition, we develop an efficient heuristic procedure to allocate buffers in serial production lines to maximise throughput. The results of the computational experiments indicate that the proposed algorithm is very efficient in terms of both solution quality and CPU time requirements. Moreover, the characterisation study yields interesting findings that may lead to important practical implications. A comprehensive bibliography is also provided in the paper